Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs
نویسندگان
چکیده
منابع مشابه
Treewidth of Erdös-Rényi Random Graphs, Random Intersection Graphs, and Scale-Free Random Graphs
We prove that the treewidth of an Erdös-Rényi random graph G(n,m) is, with high probability, greater than βn for some constant β > 0 if the edge/vertex ratio mn is greater than 1.073. Our lower bound mn > 1.073 improves the only previously-known lower bound established in [19]. We also study the treewidth of random graphs under two other random models for large-scale complex networks. In partic...
متن کاملScale-free random graphs and Potts model
We introduce a simple algorithm that constructs scale-free random graphs efficiently: each vertex i has a prescribed weight Pi ∝ i−μ (0 < μ < 1) and an edge can connect vertices i and j with rate PiPj . Corresponding equilibrium ensemble is identified and the problem is solved by the q → 1 limit of the q-state Potts model with inhomogeneous interactions for all pairs of spins. The number of loo...
متن کاملEpidemics on random intersection graphs
In this paper we consider a model for the spread of a stochastic SIR (Susceptible → Infectious → Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of cliques, each of random size, and infection can be transmitted between two individuals if and only if there is a clique they both belong to. Both the clique sizes and th...
متن کاملCoupling Scale-Free and Classical Random Graphs
Recently many new “scale-free” random graph models have been introduced, motivated by the power-law degree sequences observed in many large-scale real-world networks. The most studied of these is the Barabási-Albert growth with “preferential attachment” model, made precise as the LCD model by the present authors. Here we use coupling techniques to show that in certain ways the LCD model is not ...
متن کاملHyperbolic Random Graphs: Separators and Treewidth
Hyperbolic random graphs share many common properties with complex real-world networks; e.g., small diameter and average distance, large clustering coefficient, and a power-law degree sequence with adjustable exponent β. Thus, when analyzing algorithms for large networks, potentially more realistic results can be achieved by assuming the input to be a hyperbolic random graph of size n. The wors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.10.013